Cyclic Cryptographic Technique Using Substitution and Genetic Function
نویسندگان
چکیده
The paper introduces a new algorithm for encryption and decryption. The process of substitution and genetic function is the core of the algorithm. With the use of the below mentioned method encryption or decryption of a message would be done in a new way. KeywordsBlock Division, Decryption, Encryption, Genetic Function, Key, Substitution.
منابع مشابه
Cryptographic Technique using Substitution through Circular Path Followed by Genetic Function
In this paper a new algorithm for encryption and decryption is introduced. The process of substitution and genetic function is the core of the proposed algorithm. In this encryption technique two keys are required for the encryption or decryption of a message. Input stream will be produced intermediate cipher text on which two stages of crossover will be used in the process of encryption and de...
متن کاملSecret Information Steganography Using LSB Insertion Methodwithout Bit Layout Section with Increasing Substitution Rate and High Reliability
In this paper, a faster method for embedding cryptographic information in the image ispresented by expressing the concept of latent prints (Steganography). Data is encrypted bytwo methods before embedding to increase reliability. Then they are embedded into the imageby a button, a method has been expressed to reduce potential noise impact on the wayinformation is encoded.
متن کاملFINDING HIGHLY PROBABLE DIFFERENTIAL CHARACTERISTICS OF SUBSTITUTION-PERMUTATION NETWORKS USING GENETIC ALGORITHMS
In this paper, we propose a genetic algorithm, called GenSPN, for finding highly probable differential characteristics of substitution permutation networks (SPNs). A special fitness function and a heuristic mutation operator have been used to improve the overall performance of the algorithm. We report our results of applying GenSPN for finding highly probable differential characteristics of Ser...
متن کاملOn Ideal Lattices, Gr\"obner Bases and Generalized Hash Functions
In this paper, we draw connections between ideal lattices and multivariate polynomial rings over integers using Gröbner bases. Univariate ideal lattices are ideals in the residue class ring, Z[x]/〈f〉 (here f is a monic polynomial) and cryptographic primitives have been built based on these objects. Ideal lattices in the univariate case are generalizations of cyclic lattices. We introduce the no...
متن کاملSpectral Characterization and Analysis of Avalanche in Cryptographic Substitution Boxes using Walsh-Hadamard Transformations
This paper presents a novel analytical technique of examining the avalanche characteristics of cryptographic substitution boxes (s-boxes) using the Walsh Hadamard spectral analysis of their Boolean maps. Avalanche is a desirable cryptographic property that is necessary to ensure that a cipher is not susceptible to statistical attacks and small difference between two plaintexts results in a sign...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013